ABSTRACT

A mobile ad hoc network is an infrastructure-less network where the nodes are free to move independently in any direction. The nodes have limited power and their set of neighbours, both uplink and downlink, change with time due to the inherent dynamism of the nodes. When multiple message forwarding requests arrive at one particular node, it needs to arrange them within its queue according to a suitable scheduling algorithm that is energy efficient as well as concerned about the relative velocity of the associated nodes. The present article proposes one such scheduling algorithm DEV-NS (Delay-efficient Energy and Velocity Conscious Nonpreemptive Scheduler) that instructs each node to assign weights to its uplink neighbours at regular intervals. Message forwarding request from the uplink neighbour with highest weight is served first. Simulation results clearly establish the fact that among all the state-of-the-art scheduling algorithms, DEV-NS produces much better result in terms of end-to-end delay, message cost, network throughput and connectivity ratio.

Keywords: - Ad hoc network, delay-efficiency, energy, non-preemption, scheduling, velocity, weight.